An Investigation of Recursive Auto-associative Memory in Sentiment Detection
نویسندگان
چکیده
The rise of blogs, forums, social networks and review websites in recent years has provided very accessible and convenient platforms for people to express thoughts, views or attitudes about topics of interest. In order to collect and analyse opinionated content on the Internet, various sentiment detection techniques have been developed based on an integration of part-of-speech tagging, negation handling, lexicons and classifiers. A popular unsupervised approach, SO-LSA (Semantic Orientation from Latent Semantic Analysis), uses a term-document matrix to detect the semantic orientation of words according to their similarities to a predefined set of seed terms. This paper proposes a novel and subsymbolic approach in sentiment detection, with a level of accuracy comparable to the baseline, SO-LSA, using a special type of Artificial Neural Networks (ANN), an auto-encoder called Recursive Auto-Associative Memory (RAAM).
منابع مشابه
Connectionist rule processing using recursive auto-associative memory
A limitation of many rule-based connectionist models is their dependence on structure to explicitly represent rules, and their consequent inflexibility in acquiring and applying novel rules. A model is described in which recursive auto-associative memory (RAAM) is used as an encoding mechanism to prepare rules of variable structure and content for input to a connectionist rule applicator. The e...
متن کاملModeling Grouping with Recursive Auto-Associative Memory
Sometimes humans have a need for storing long sequences of information in memory. Several experiments show that grouping the items in the sequence helps storing the sequence in auditory short-term memory. One architecture used by connectionist cognitive researchers when representing and processing sequences is Recursive Auto-Associative Memory. One of the aspects of it is that its capacity for ...
متن کاملRecursive Hetero-associative Memories for Translation
This paper presents a modiication of Pollack's RAAM (Re-cursive Auto-Associative Memory), called a Recursive Hetero-Associative Memory (RHAM), and shows that it is capable of learning simple translation tasks, by building a state-space representation of each input string and unfolding it to obtain the corresponding output string. RHAM-based translators are computationally more powerful and easi...
متن کاملEvaluation of Two Connectionist Approaches toStack
This study empirically compares two distributed connectionist learning models trained to represent an arbitrarily deep stack. One is Pol-lack's Recursive Auto-Associative Memory, a recurrent back propagating neural network that uses a hidden intermediate representation. The other is the Exponential Decay Model, a novel architecture that we propose here, which tries to learn an explicit represen...
متن کاملEvaluation of Two Connectionist Approaches to Stack Representation
This study empirically compares two distributed connectionist learning models trained to represent an arbitrarily deep stack. One is Pol-lack's Recursive Auto-Associative Memory, a recurrent back propagating neural network that uses a hidden intermediate representation. The other is the Exponential Decay Model, a novel architecture that we propose here, which tries to learn an explicit represen...
متن کامل